A modified augmented Lagrangian method for a class of monotone variational inequalities

نویسندگان

  • Bingsheng He
  • Hai Yang
  • Chen-song Zhang
چکیده

Abstract. The augmented Lagrangian method is an attractive approach for solving linearly constrained convex optimization problems (CCOP). The method is iterative and the task in each iteration is to solve a (convex optimization) sub-problem whose dimension is equal to the number of variables. For large problems, solving such a sub-problem can be still very expensive. In this paper, we propose a modified augmented Lagrangian method for a class of monotone variational inequalities which include CCOP. The computational load in each iteration of the proposed method is quite small. In order to demonstrate the ability and efficiency of the proposed method, we present some numerical results for convex nonlinear programming and traffic network equilibrium problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solutions of variational inequalities on fixed points of nonexpansive mappings

n this paper , we propose a generalized iterative method forfinding a common element of the set of fixed points of a singlenonexpannsive mapping and the set of solutions of two variationalinequalities with inverse strongly monotone mappings and strictlypseudo-contractive of Browder-Petryshyn type mapping. Our resultsimprove and extend the results announced by many others.

متن کامل

An inexact parallel splitting augmented Lagrangian method for large system of linear equations

Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse system or others with particular structure. And most are based on parallel implementation of the classical relaxation methods such as Gauss-Seidel, SOR, and AOR methods carried efficiently on multiprcessor systems. In thi...

متن کامل

Smooth methods of multipliers for complementarity problems

This paper describes several methods for solving nonlinear complementarity problems. A general duality framework for pairs of monotone operators is developed and then applied to the monotone complementarity problem, obtaining primal, dual, and primal-dual formulations. We derive Bregman-function-based generalized proximal algorithms for each of these formulations, generating three classes of co...

متن کامل

Augmented Lagrangian method for solving absolute value equation and its application in two-point boundary value problems

One of the most important topic that consider in recent years by researcher is absolute value equation (AVE). The absolute value equation seems to be a useful tool in optimization since it subsumes the linear complementarity problem and thus also linear programming and convex quadratic programming. This paper introduce a new method for solving absolute value equation. To do this, we transform a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • European Journal of Operational Research

دوره 159  شماره 

صفحات  -

تاریخ انتشار 2004